An Algorithm for Inducing Least Generalization Under Relative Implication
نویسندگان
چکیده
Inductive Logic Programming (ILP) deals with inducing clausal theories from examples basically through generalization or specialization. The specialization and generalization operators used are mainly based on three generality orderings subsumption, implication and implication relative to background knowledge. Implication is stronger than subsumption, but relative implication is more powerful because background knowledge can be used to model all sorts of useful properties and relations. The least generalization under relative implication (LGRI) does not exist in the general case, but it exists if both the set to be generalized and the background knowledge satisfy some special conditions. The present paper discusses an algorithm for computing LGRI in cases when the latter exists.
منابع مشابه
Generalization of Clauses Containing Cross Connections
In the area of inductive learning, generalization is the main operation, and the usual definition of induction is based on logical implication. Plotkin's well-known technique for computing least general generalizations of clauses under θ-subsumption sometimes produces results which are too general with respect to implication. Muggleton has shown that this problem only occurs in one type of gene...
متن کاملInductive Logic Programming Beyond Logical Implication
This paper discusses the generalization of deenite Horn programs beyond the ordering of logical implication. Since the seminal paper on generalization of clauses based on subsumption, there are various extensions in this area. Especially in inductive logic programming(ILP), people are using various methods that approximate logical implication, such as inverse resolution(IR), relative least gene...
متن کاملGeneralization of Clauses under Implication 2
In the area of inductive learning, generalization is a main operation, and the usual deenition of induction is based on logical implication. Recently there has been a rising interest in clausal representation of knowledge in machine learning. Almost all inductive learning systems that perform generalization of clauses use the relation-subsumption instead of implication. The main reason is that ...
متن کاملGeneralization of Clauses under Implication
In the area of inductive learning, generalization is a main operation, and the usual deenition of induction is based on logical implication. Recently there has been a rising interest in clausal representation of knowledge in machine learning. Almost all inductive learning systems that perform generalization of clauses use the relation-subsumption instead of implication. The main reason is that ...
متن کاملLeast Generalizations and Greatest Specializations of Sets of Clauses
The main operations in Inductive Logic Programming (ILP) are generalization and specialization, which only make sense in a generality order. In ILP, the three most important generality orders are subsumption, implication and implication relative to background knowledge. The two languages used most often are languages of clauses and languages of only Horn clauses. This gives a total of six diier...
متن کامل